Verification Constraint Problems with Strengthening
نویسندگان
چکیده
The deductive method reduces verification of safety properties of programs to, first, proposing inductive assertions and, second, proving the validity of the resulting set of first-order verification conditions. We discuss the transition from verification conditions to verification constraints that occurs when the deductive method is applied to parameterized assertions instead of fixed expressions (e.g., p0 +p1j+p2k ≥ 0, for parameters p0, p1, and p2, instead of 3+j−k ≥ 0) in order to discover inductive assertions. We then introduce two new verification constraint forms that enable the incremental and propertydirected construction of inductive assertions. We describe an iterative method for solving the resulting constraint problems. The main advantage of this approach is that it uses off-the-shelf constraint solvers and thus directly benefits from progress in constraint solving.
منابع مشابه
Efficient BDD Encodings for Partial Order Constraints with Application to Expert Systems in Software Verification
We introduce a class of computational problems called the partial order constraint satisfaction problems (POCSPs) and present three methods for encoding them as binary decision diagrams (BDDs). The first method, which simply augments domain constraints with the transitivity and asymmetry for partial orders, is improved by the second method, which introduces the notion of domain variables to red...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملEFSMT: A Logical Framework for Cyber-Physical Systems
The design of cyber-physical systems is challenging in that it includes the analysis and synthesis of distributed and embedded real-time systems for controlling, often in a nonlinear way, the environment. We address this challenge with EFSMT, the exists-forall quantified first-order fragment of propositional combinations over constraints (including nonlinear arithmetic), as the logical framewor...
متن کاملSpecification and Verification of Interaction Protocols: a Computational Logic Approach Based on Abduction
In this paper we propose a logic-based approach for the specification and verification of interaction protocols. We give the syntax of the proposed language, declarative and operational semantics of an abductive proof procedure for compliance verification. The proof procedure uses constraints for efficiently dealing with large-scale problems, and is implemented in Constraint Handling Rules. We ...
متن کاملRigorous verification of feasibility
This paper considers the problem of finding and verifying feasible points for constraint satisfaction problems, including those with uncertain coefficients. The main part is devoted to the problem of finding a narrow box around an approximately feasible solution for which it can be rigorously and automatically proved that it contains a feasible solution. Some examples demonstrate difficulties w...
متن کامل